Automatic Visualization of Recursion Trees
نویسندگان
چکیده
منابع مشابه
Automatic visualization of recursion trees: a case study on generic programming
Although the principles behind generic programming are already well understood, this style of programming is not widespread and examples of applications are rarely found in the literature. This paper addresses this shortage by presenting a new method, based on generic programming, to automatically visualize recursion trees of functions written in Haskell. Crucial to our solution is the fact tha...
متن کاملVisualization of Phylogenetic Trees
We present a spring-embedder model for drawing rooted and unrooted phylogenetic trees with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually intuitive, and efficient algorithm. These algorithms are implemented on a web-based phylogeny visualization system that interoperates with existing...
متن کاملVisualization of Uncertain Contour Trees
Contour trees can represent the topology of large volume data sets in a relatively compact, discrete data structure. However, the resulting trees often contain many thousands of nodes; thus, many graph drawing techniques fail to produce satisfactory results. Therefore, several visualization methods were proposed recently for the visualization of contour trees. Unfortunately, none of these techn...
متن کاملInteractive Visualization of Fault Trees
In this paper we present a case study of using interactive visualization of fault trees and fault tree analysis to improve understanding of the concept of fault trees and the exploration of the results of their analysis. The fault tree model is widely used by experts to analyze risks in many different fields. We believe that the current way of interacting with these fault tree models and the re...
متن کاملStructural Recursion on Ordered Trees and List-Based Complex Objects
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vertical recursion down a tree combined with horizontal recursion across a list of trees gives rise to a robust class of transformations: it captures t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80694-7